On the performance of optimal double circulant even codes
نویسندگان
چکیده
In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decoding. To do this, we classify the optimal double circulant even codes that are not self-dual which have the smallest weight distribution for lengths up to 72. We also give some restrictions on the weight enumerators of (extremal) selfdual [54, 27, 10] codes with shadows of minimum weight 3. Finally, we consider the performance of extremal self-dual codes of lengths 88 and 112.
منابع مشابه
Computational Results of Duadic Double Circulant Codes
Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes, called duadic double circulant codes, which is a generalization of quadratic double circulant codes for prime lengths. This class generates optimal self-dual...
متن کاملOn doubly circulant doubly even self-dual [72, 36, 12] codes
We give a classification of all double circulant doubly even self-dual [72, 36, 12] codes. We also demonstrate that every double circulant doubly even self-dual [72, 36, 12] code has no extremal doubly even self-dual [72, 36, 16] neighbor.
متن کاملNew self-dual codes of length 72
In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by replacing the first row in each circulant in a double circulant code by "all ones" and "all zeros" vectors respectively. Keywords—convolutional encoding, qu...
متن کاملOn self-dual double circulant codes
Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with relative distance satisfying a modified Gilbert-Varshamov bound.
متن کاملConvolutional encoding of 60, 64, 68, 72-bit self-dual codes
In this paper we obtain [60,30,12], [64,32,12], [68,34,12], [72,36,12] doubly even self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two add to the one of the encoder outputs and this row will replace the first row in the double circulant matrix. The pure double circulant construction with K=10 is also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1604.06878 شماره
صفحات -
تاریخ انتشار 2016